Discrete gauging and Hasse diagrams

نویسندگان

چکیده

We analyse the Higgs branch of 4d $\mathcal{N}=2$ SQCD gauge theories with non-connected groups $\widetilde{\mathrm{SU}}(N) = \mathrm{SU}(N) \rtimes_{I,II} \mathbb{Z}_2$ whose study was initiated in arXiv:1804.01108. derive Hasse diagrams corresponding to mechanism using adapted characters for representations groups. propose 3d $\mathcal{N}=4$ magnetic quivers branches type $I$ discrete gauging case, form recently introduced wreathed quivers, and provide extensive checks by means Coulomb Hilbert series computations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Confluent Hasse Diagrams

We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with O(n2) features, in an O(n)×O(n) grid in O(n2) time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with O(n) features in an O(n)×O(n) grid i...

متن کامل

Synthesizing Petri Nets from Hasse Diagrams

Synthesis aims at producing a process model from specified sample executions. A user can specify a set of executions of a system in a specification language that is much simpler than a process modeling language. The intended process model is then constructed automatically. Synthesis algorithms have been extensively explored for cases where the specification language is a reachability graph or a...

متن کامل

Folded Hasse diagrams of combined traces

To represent concurrent behaviours one can use concepts originating from language theory, including traces and comtraces. Traces can express notions such as concurrency and causality, whereas comtraces can also capture weak causality and simultaneity. This paper is concerned with the development of efficient data structures and algorithms for manipulating comtraces. We introduce and investigate...

متن کامل

Weakly transitive orientations, Hasse diagrams and string graphs

Middendorf, M. and F. Pfeiffer, Weakly transitive orientations, Hasse diagrams and string graphs, Discrete Mathematics 111 (1993) 393-400. We introduce the notion of a weakly transitive orientation for graphs as a natural generalization of transitive orientations and give a characterization for weakly transitive orientations in terms of forbidden substructurs. As a corollary of this characteriz...

متن کامل

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SciPost physics

سال: 2021

ISSN: ['2542-4653']

DOI: https://doi.org/10.21468/scipostphys.11.2.026